Novel Systolic Array Design for the Discrete Hartley Transform with High Throughput Rate
نویسندگان
چکیده
--In this paper, three attractive features for the DHT transform are derived, including (1)the Single/ Double Data Folding ; (2) the constructive feature and (3) the data reusage. By using CORDIC algorithm, The DHT Transform Kernel hm*[cose+ sine] and conjugate kernel h,*[cose-sln€I I can be simultanously determined. With these favorable properties, a novel systolic array design for the Discrete Hartley Transform has been designed with eight times throughput of the linear systolic array designed by [l].
منابع مشابه
Efficient systolic solution for a new prime factor discrete Hartley transform algorithm - Circuits, Devices and Systems, IEE Proceedings G
Recently, a novel systolic structure has been proposed for the computation of DFT for transform length N = 4 M , M being prime to 4. In this paper, we have proposed a similar structure for the computation of DHT by prime factor decomposition. A new recursive algorithm is also proposed for computing DHT using a linear systolic array of cordic processing elements. The proposed structure has nearl...
متن کاملAn Efficient Design Approach for a Prime-length Generalized Hartley Transform Systolic Array
An efficient approach to the design of a VLSI array for a prime-length type III generalized discrete Hartley transform (GDHT) is presented. The design makes use of an appropriate decomposition of the GDHT into two half-length circular correlation structures having the same length and form that can be concurrently computed and implemented on a single linear systolic array using some of the known...
متن کاملEfficient CORDIC-based systolic architectures for the discrete Hartley transform - Computers and Digital Techniques, IEE Proceedings-
The paper presents two new linear systolic architectures for the one-dimensional discrete Hartley transform (DHT). Both architectures exhibit several desired features such as regularity, modularity and high pipelineability, which make them amenable to VLSI hardware implementation. In addition these new architectures use the CORDIC (co-ordinate rotation digital computer) algorithm as the basic f...
متن کاملGENERATION OF MULTIPLE SPECTRUM-COMPATIBLE ARTIFICIAL EARTHQUAKE ACCELEGRAMS WITH HARTLEY TRANSFORM AND RBF NEURAL NETWORK
The Hartley transform, a real-valued alternative to the complex Fourier transform, is presented as an efficient tool for the analysis and simulation of earthquake accelerograms. This paper is introduced a novel method based on discrete Hartley transform (DHT) and radial basis function (RBF) neural network for generation of artificial earthquake accelerograms from specific target spectrums. Acce...
متن کاملAn efficient prime-factor algorithm for the discrete cosine transform and its hardware implementations
The prime-factor decomposition is a fast computational technique for many important digital signal processing operations, such as the convolution, the discrete Fourier transform, the discrete Hartley transform, and the discrete cosine transform (DCT). In this paper, we present a new prime-factor algorithm for the DCT. We also design a prime-factor algorithm for the discrete sine transform which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993